On minimal cutsets in P5-free minimal imperfect graphs
نویسندگان
چکیده
Let G be a minimal imperfect P 5-free graph (i.e. a minimal imperfect graph not containing a path on 5 vertices as induced subgraph) and let S be a minimal cutset of G. In this paper we study several properties of such cutsets, in particular we prove that the subgraph induced by S is connected, contains a P 4 , cannot induce a bipartite subgraph of G .... As a by-product we also give a structural characterization of such graphs.
منابع مشابه
Graphs with complete minimal k-vertex separators
G. A. Dirac characterized chordal graphs as those in which minimal vertex separators always induce complete subgraphs. I generalize a traditional (2-)vertex separator to a k-vertex separator — meaning a set S of vertices whose removal puts k independent vertices into k separate components. Generalizing Dirac’s theorem, the {P5, 2P3}-free chordal graphs are the graphs in which minimal k-separato...
متن کاملThe connectivity of minimal imperfect graphs
We prove that partitionable graphs are 2w 2-connected, that this bound is sharp, and prove some structural properties of cutsets of cardinality 2w 2. The proof of the connectivity result is a simple linear algebraic proof.
متن کاملA Certifying Algorithm for 3-Colorability of P5-Free Graphs
We provide a certifying algorithm for the problem of deciding whether a P5-free graph is 3-colorable by showing there are exactly six finite graphs that are P5-free and not 3-colorable and minimal with respect to this property.
متن کاملNew Results on Minimal Strongly Imperfect Graphs
The characterization of strongly perfect graphs by a restricted list of forbidden induced subgraphs has remained an open question for a long time. The minimal strongly imperfect graphs which are simultaneous imperfect are only odd holes and odd antiholes ( E. Olaru, [9]), but the entire list is not known, in spite of a lot of particular results in this direction. In this paper we give some new ...
متن کاملOn vertex neighborhood in minimal imperfect graphs
Lubiw [11] conjectures that in a minimal imperfect Berge graph, the neighborhood graph N (v) of any vertex v must be connected; this conjecture implies a well known Chvátal’s Conjecture [6] which states that N (v) must contain a P4. In this note we will prove an intermediary conjecture for some classes of minimal imperfect graphs. It is well known that a graph is P4-free if, and only if, every ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 236 شماره
صفحات -
تاریخ انتشار 2001